Minimum-hamming-distance decoding of single-generator binary convolutional codes

Linear Binary Error Correcting Codes with Specified Minimum Hamming Distance

Syndrome decoding of binary convolutional codes

This thesis concerns the decoding of conventional convolutionalcodes. Two new decoding methods are developed that both use a channelnoise generated syndrome. The first decoder is based on the polynomialparity matrix HT, whereas the second one uses both the matrices BT and(H-l)T, i.e. the transpose of the right inverse of H. Hence, the codegenerator G does not play the promin...

Syndrome Decoding of Binary Convolutional Codes

This thesis concerns the decoding of conventional convolutionalcodes. Two new decoding methods are developed that both use a channelnoise generated syndrome. The first decoder is based on the polynomialparity matrix HT, whereas the second one uses both the matrices BT and(H-l)T, i.e. the transpose of the right inverse of H. Hence, the codegenerator G does not play the promin...

Syndrome decoding of binary convolutional codes

This thesis concerns the decoding of conventional convolutionalcodes. Two new decoding methods are developed that both use a channelnoise generated syndrome. The first decoder is based on the polynomialparity matrix HT, whereas the second one uses both the matrices BT and(H-l)T, i.e. the transpose of the right inverse of H. Hence, the codegenerator G does not play the promin...

Syndrome decoding of binary convolutional codes

This thesis concerns the decoding of conventional convolutionalcodes. Two new decoding methods are developed that both use a channelnoise generated syndrome. The first decoder is based on the polynomialparity matrix HT, whereas the second one uses both the matrices BT and(H-l)T, i.e. the transpose of the right inverse of H. Hence, the codegenerator G does not play the promin...